Distributing Equational Theorem Proving 1

نویسندگان

  • J. Avenhaus
  • J. Denzinger
چکیده

In this paper we show that distributing the theorem proving task to several experts is a promising idea. We describe the team work method which allows the experts to compete for a while and then to cooperate. In the cooperation phase the best results derived in the competition phase are collected and the less important results are forgotten. We describe some useful experts and explain in detail how they work together. We establish fairness criteria and so prove the distributed system to be both, complete and correct. We have implemented our system and show by non-trivial examples that drastical time speed-ups are possible for a cooperating team of experts compared to the time needed by the best expert in the team. 1 A short version of this paper appears in the proceedings of RTA-93.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theorem Proving for Maude’s Rewriting Logic Vlad Rusu and Manuel Clavel

We present an approach based on inductive theorem proving for verifying invariance properties of systems specified in Rewriting Logic, an executable specification language implemented (among others) in the Maude tool. Since theorem proving is not directly available for rewriting logic, we define an encoding of rewriting logic into its membership equational (sub)logic. Then, inductive theorem pr...

متن کامل

Goal Oriented Equational Theorem Proving Using Team Work

The team work method is a concept for distributing automated theorem provers and so to activate several experts to work on a given problem. We have implemented this for pure equational logic using the unfailing Knuth-Bendix completion procedure as basic prover. In this paper we present three classes of experts working in a goal oriented fashion. In general, goal oriented experts perform their j...

متن کامل

Integrating Decision Procedures in Reflective Rewriting-Based Theorem Provers ?

We propose a design for the integration of decision procedures in reflective rewritingbased equational theorem provers. Rewriting-based equational theorem provers use term rewriting as their basic proof engine; they are particularly well suited for proving properties of equational specifications. A reflective rewriting-based theorem prover is itself an executable equational specification, which...

متن کامل

Smaran: A Congruence-Closure Based System for Equational Computations

p. 1 Redundancy Criteria for Constrained Completion p. 2 Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations p. 17 A Case Study of Completion Modulo Distributivity and Abelian Groups p. 32 A Semantic Approach to Order-Sorted Rewriting p. 47 Distributing Equational Theorem Proving p. 62 On the Correctness of a Distributed Memory Grobner Basis Algorithm p. 77 Improving Transfor...

متن کامل

An Application of Automated Equational Reasoning to Many-valued Logic

In this paper we present the theorem prover SBR3 for equational logic and its application in the many-valued logic of Lukasiewicz. We give a new equational axiomatization of many-valued logic and we prove by SBR3 that it is equivalent to the classical equational presentation of such logic given by Wajsberg. We feel that our equational axiomatization of Wajsberg algebras is more suited for autom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993